在带有频划分双链体（FDD）的常规多用户多用户多输入多输出（MU-MIMO）系统中，尽管高度耦合，但已单独设计了通道采集和预编码器优化过程。本文研究了下行链路MU-MIMO系统的端到端设计，其中包括试点序列，有限的反馈和预编码。为了解决这个问题，我们提出了一个新颖的深度学习（DL）框架，该框架共同优化了用户的反馈信息生成和基础站（BS）的预编码器设计。 MU-MIMO系统中的每个过程都被智能设计的多个深神经网络（DNN）单元所取代。在BS上，神经网络生成试验序列，并帮助用户获得准确的频道状态信息。在每个用户中，频道反馈操作是由单个用户DNN以分布方式进行的。然后，另一个BS DNN从用户那里收集反馈信息，并确定MIMO预编码矩阵。提出了联合培训算法以端到端的方式优化所有DNN单元。此外，还提出了一种可以避免针对可扩展设计的不同网络大小进行重新训练的培训策略。数值结果证明了与经典优化技术和其他常规DNN方案相比，提出的DL框架的有效性。

来自磁共振成像（MRI）的体积图像在直肠癌的术前分期提供了宝贵的信息。最重要的是，T2和T3阶段之间的准确术前歧视可以说是直肠癌治疗的最具挑战性和临床意义的任务，因为通常建议对T3（或更大）阶段癌症患者进行化学疗法。在这项研究中，我们提出了一个体积卷积神经网络，可准确区分T2与直肠MR体积的T3阶段直肠癌。具体而言，我们提出1）基于自定义的基于重新连接的卷编码器，该编码器与晚期融合的固定间关系建模（即最后一层的3D卷积），2）双线性计算，该计算汇总了编码器所得的功能以创建一个创建一个的功能体积特征和3）三重损失和焦点损失的关节最小化。通过病理确认的T2/T3直肠癌的MR量，我们进行了广泛的实验，以比较残留学习框架内的各种设计。结果，我们的网络达到了0.831的AUC，高于专业放射科医生组的准确性。我们认为该方法可以扩展到其他卷分析任务

学习估计对象姿势通常需要地面真理（GT）标签，例如CAD模型和绝对级对象姿势，这在现实世界中获得昂贵且费力。为了解决这个问题，我们为类别级对象姿势估计提出了一个无监督的域适应（UDA），称为\ textbf {uda-cope}。受到最近的多模态UDA技术的启发，所提出的方法利用教师学生自我监督的学习方案来训练姿势估计网络而不使用目标域标签。我们还在预测归一化对象坐标空间（NOCS）地图和观察点云之间引入了双向滤波方法，不仅使我们的教师网络更加强大地对目标域，而且为学生网络培训提供更可靠的伪标签。广泛的实验结果表明了我们所提出的方法的有效性，可以定量和定性。值得注意的是，在不利用目标域GT标签的情况下，我们所提出的方法可以实现与依赖于GT标签的现有方法相当或有时优越的性能。

Test-time adaptation (TTA) has attracted significant attention due to its practical properties which enable the adaptation of a pre-trained model to a new domain with only target dataset during the inference stage. Prior works on TTA assume that the target dataset comes from the same distribution and thus constitutes a single homogeneous domain. In practice, however, the target domain can contain multiple homogeneous domains which are sufficiently distinctive from each other and those multiple domains might occur cyclically. Our preliminary investigation shows that domain-specific TTA outperforms vanilla TTA treating compound domain (CD) as a single one. However, domain labels are not available for CD, which makes domain-specific TTA not practicable. To this end, we propose an online clustering algorithm for finding pseudo-domain labels to obtain similar benefits as domain-specific configuration and accumulating knowledge of cyclic domains effectively. Moreover, we observe that there is a significant discrepancy in terms of prediction quality among samples, especially in the CD context. This further motivates us to boost its performance with gradient denoising by considering the image-wise similarity with the source distribution. Overall, the key contribution of our work lies in proposing a highly significant new task compound domain test-time adaptation (CD-TTA) on semantic segmentation as well as providing a strong baseline to facilitate future works to benchmark.

Universal Domain Adaptation aims to transfer the knowledge between the datasets by handling two shifts: domain-shift and category-shift. The main challenge is correctly distinguishing the unknown target samples while adapting the distribution of known class knowledge from source to target. Most existing methods approach this problem by first training the target adapted known classifier and then relying on the single threshold to distinguish unknown target samples. However, this simple threshold-based approach prevents the model from considering the underlying complexities existing between the known and unknown samples in the high-dimensional feature space. In this paper, we propose a new approach in which we use two sets of feature points, namely dual Classifiers for Prototypes and Reciprocals (CPR). Our key idea is to associate each prototype with corresponding known class features while pushing the reciprocals apart from these prototypes to locate them in the potential unknown feature space. The target samples are then classified as unknown if they fall near any reciprocals at test time. To successfully train our framework, we collect the partial, confident target samples that are classified as known or unknown through on our proposed multi-criteria selection. We then additionally apply the entropy loss regularization to them. For further adaptation, we also apply standard consistency regularization that matches the predictions of two different views of the input to make more compact target feature space. We evaluate our proposal, CPR, on three standard benchmarks and achieve comparable or new state-of-the-art results. We also provide extensive ablation experiments to verify our main design choices in our framework.

本文介绍了一个分散的多代理轨迹计划（MATP）算法，该算法保证在有限的沟通范围内在障碍物丰富的环境中生成安全，无僵硬的轨迹。所提出的算法利用基于网格的多代理路径计划（MAPP）算法进行僵局，我们引入了子目标优化方法，使代理会收敛到从MAPP生成的无僵局生成的路点。此外，提出的算法通过采用线性安全走廊（LSC）来确保优化问题和避免碰撞的可行性。我们验证所提出的算法不会在随机森林和密集的迷宫中造成僵局，而不论沟通范围如何，并且在飞行时间和距离方面的表现都优于我们以前的工作。我们通过使用十个四肢的硬件演示来验证提出的算法。

本文介绍了用于合成近红外（NIR）图像生成和边界盒水平检测系统的数据集。不可否认的是，诸如Tensorflow或Pytorch之类的高质量机器学习框架以及大规模的Imagenet或可可数据集借助于加速GPU硬件，已将机器学习技术的极限推向了数十多年。在这些突破中，高质量的数据集是可以在模型概括和数据驱动的深神经网络的部署方面取得成功的基本构件之一。特别是，综合数据生成任务通常比其他监督方法需要更多的培训样本。因此，在本文中，我们共享从两个公共数据集（即Nirscene和Sen12ms）和我们的新颖NIR+RGB甜椒（辣椒（辣椒）数据集）重新处理的NIR+RGB数据集。我们定量和定性地证明了这些NIR+RGB数据集足以用于合成NIR图像生成。对于NIRSCENE1，SEN12MS和SEWT PEPPER数据集，我们实现了第11.36、26.53、26.53、26.53和40.15的距离（FID）。此外，我们发布了11个水果边界盒的手动注释，可以使用云服务将其作为各种格式导出。四个新添加的水果[蓝莓，樱桃，猕猴桃和小麦]化合物11新颖的边界盒数据集，在我们先前的DeepFruits项目中提出的作品[Apple，Appsicum，Capsicum，Capsicum，Mango，Orange，Rockmelon，Strawberry]。数据集的边界框实例总数为162K，可以从云服务中使用。为了评估数据集，YOLOV5单阶段检测器被利用并报告了令人印象深刻的平均水平前期，MAP [0.5：0.95]的结果为[min：0.49，最大：0.812]。我们希望这些数据集有用，并作为未来研究的基准。

由于它可能对粮食安全，可持续性，资源利用效率，化学处理的降低以及人类努力和产量的优化，因此，自主机器人在农业中的应用正在越来越受欢迎。有了这一愿景，蓬勃发展的研究项目旨在开发一种适应性的机器人解决方案，用于精确耕作，该解决方案结合了小型自动无人驾驶飞机（UAV）（UAV）的空中调查能力以及由多功能无人驾驶的无人接地车（UGV）执行的针对性干预措施。本文概述了该项目中获得的科学和技术进步和结果。我们引入了多光谱感知算法以及空中和地面系统，用于监测农作物密度，杂草压力，作物氮营养状况，并准确地对杂草进行分类和定位。然后，我们介绍了针对我们在农业环境中机器人身份量身定制的导航和映射系统，以及用于协作映射的模块。我们最终介绍了我们在不同的现场条件和不同农作物中实施和测试的地面干预硬件，软件解决方案以及接口。我们描述了一个真正的用例，在该案例中，无人机与UGV合作以监视该领域并进行选择性喷涂而无需人工干预。

The 3D-aware image synthesis focuses on conserving spatial consistency besides generating high-resolution images with fine details. Recently, Neural Radiance Field (NeRF) has been introduced for synthesizing novel views with low computational cost and superior performance. While several works investigate a generative NeRF and show remarkable achievement, they cannot handle conditional and continuous feature manipulation in the generation procedure. In this work, we introduce a novel model, called Class-Continuous Conditional Generative NeRF ($\text{C}^{3}$G-NeRF), which can synthesize conditionally manipulated photorealistic 3D-consistent images by projecting conditional features to the generator and the discriminator. The proposed $\text{C}^{3}$G-NeRF is evaluated with three image datasets, AFHQ, CelebA, and Cars. As a result, our model shows strong 3D-consistency with fine details and smooth interpolation in conditional feature manipulation. For instance, $\text{C}^{3}$G-NeRF exhibits a Fr\'echet Inception Distance (FID) of 7.64 in 3D-aware face image synthesis with a $\text{128}^{2}$ resolution. Additionally, we provide FIDs of generated 3D-aware images of each class of the datasets as it is possible to synthesize class-conditional images with $\text{C}^{3}$G-NeRF.

Cellular automata (CA) captivate researchers due to teh emergent, complex individualized behavior that simple global rules of interaction enact. Recent advances in the field have combined CA with convolutional neural networks to achieve self-regenerating images. This new branch of CA is called neural cellular automata [1]. The goal of this project is to use the idea of idea of neural cellular automata to grow prediction machines. We place many different convolutional neural networks in a grid. Each conv net cell outputs a prediction of what the next state will be, and minimizes predictive error. Cells received their neighbors' colors and fitnesses as input. Each cell's fitness score described how accurate its predictions were. Cells could also move to explore their environment and some stochasticity was applied to movement.